Generalized persistence diagrams for persistence modules over posets

نویسندگان

چکیده

When a category $\mathcal{C}$ satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors $F:\mathbf{P} \rightarrow \mathcal{C}$ from theory perspective. This generalizes standard as well Patel's recent extension. Specifically, barcode any interval decomposable persistence modules \mathbf{vec}$ finite dimensional vector spaces can be extracted by principle inclusion-exclusion. Generalizing this idea allows freedom choosing indexing poset $\mathbf{P}$ $F: \mathbf{P} in defining generalized diagram $F$. Of particular importance is fact that $F$ defined regardless whether or not. By specializing our to zigzag modules, also show Reeb graph obtained purely set-theoretic setting without passing spaces. leads promotion semicontinuity theorem about type $\mathcal{A}$ Lipschitz continuity sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metrics for generalized persistence modules

We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of examples, inverseimage persistence modules, which occur whenever a topological space is mapped to a metric space. Several standard theories of persistence a...

متن کامل

Confidence Sets for Persistence Diagrams

Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features as one varies a tuning parameter. Features with short lifetimes are informally considered to be “topological noise,” and those with a long lifetime are considered to be “topological signal.” In this paper, we bring some statis...

متن کامل

Fréchet Means for Distributions of Persistence Diagrams

Given a distribution ρ on persistence diagrams and observations X1, ...Xn iid ∼ ρ we introduce an algorithm in this paper that estimates a Fréchet mean from the set of diagrams X1, ...Xn. If the underlying measure ρ is a combination of Dirac masses ρ = 1 m ∑m i=1 δZi then we prove the algorithm converges to a local minimum and a law of large numbers result for a Fréchet mean computed by the alg...

متن کامل

CONFIDENCE SETS FOR PERSISTENCE DIAGRAMS By Brittany

Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features as one varies a tuning parameter. Features with short lifetimes are informally considered to be “topological noise,” and those with a long lifetime are considered to be “topological signal.” In this paper, we bring some statis...

متن کامل

Persistence modules: Algebra and algorithms

Abstract. Persistent homology was shown by Zomorodian and Carlsson [35] to be homology of graded chain complexes with coefficients in the graded ring k[t]. As such, the behavior of persistence modules — graded modules over k[t] — is an important part in the analysis and computation of persistent homology. In this paper we present a number of facts about persistence modules; ranging from the wel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of applied and computational topology

سال: 2021

ISSN: ['2367-1726', '2367-1734']

DOI: https://doi.org/10.1007/s41468-021-00075-1